Cohomological divisibility and point count divisibility

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Perfect divisibility and 2-divisibility

A graph G is said to be 2-divisible if for all (nonempty) induced subgraphs H of G, V (H) can be partitioned into two sets A,B such that ω(A) < ω(H) and ω(B) < ω(H). A graph G is said to be perfectly divisible if for all induced subgraphs H of G, V (H) can be partitioned into two sets A,B such that H[A] is perfect and ω(B) < ω(H). We prove that if a graph is (P5, C5)-free, then it is 2-divisibl...

متن کامل

Indefinite Divisibility

Some hold that the lesson of Russell’s paradox and its relatives is that mathematical reality does not form a “definite totality” but rather is “indefinitely extensible”. There can always be more sets than there ever are. I argue that certain contact puzzles are analogous to Russell’s paradox this way: they similarly motivate a vision of physical reality as iteratively generated. In this pictur...

متن کامل

Divisibility Tests

In this paper, we give a new method to test the divisibility of any positive integer by another. First, we outline the usual test, in which one proceeds from right to left, i.e. the direction opposite the one taken while carrying out long division. After pointing out some of the problems with this method, we give another method, which forms the core of this paper. This latter method works along...

متن کامل

Divisibility Sequence

An elliptic divisibility sequence (EDS) is a sequence of integers (Wn)n≥0 generated by the nonlinear recursion satisfied by the division polyomials of an elliptic curve. We give a formula for the sign of Wn for unbounded nonsingular EDS, a typical case being Sign(Wn) = (−1) ⌊nβ⌋ for an irrational number β ∈ R. As an application, we show that the associated sequence of absolute values (|Wn|) can...

متن کامل

Divisibility and State−Complexity

A sequence a = Han L is B−automatic if it can be recognized by a finite state machine in the sense that, on input n, the machine outputs an . Here n is usually written in standard base B notation, though other numeration systems are also considered. A typical example is the Morse−Thue sequence Htn L which is usually defined in terms of iterated morphisms. However, there is an alternative charac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Compositio Mathematica

سال: 2004

ISSN: 0010-437X,1570-5846

DOI: 10.1112/s0010437x04000934